Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2010, Vol. 33 ›› Issue (3): 135-138.doi: 10.13190/jbupt.201003.135.zhouyj

• Reports • Previous Articles     Next Articles

A Blind Recognition of the (n, n-1, m) Convolution Code

ZHOU Ya-jian1, LIU Jian2   

  1. (1. State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China; 

    2. State Key Laboratory of Integrated Service Networks,  Xidian University,  Xi'an 710071,  China)

  • Online:2010-06-28 Published:2010-06-28
  • Contact: ZHOU Ya-jian E-mail:yajian@bupt.edu.cn.

Abstract:

In order to solve the problem of the blind recognition of channel coding, a blind recognition method

of identifying (n-1)/n convolution code is proposed. Firstly, a mathematical model of blind recog-

nition is given, followed by a method of solving parity check matrix through decomposition of the mat-

rix constructed by the intercepted code. Meanwhile, by the elementary transform of the parity check

matrix, the blind recognition of convolution code can be achieved. Simulations show that the proposed

method can recognize the convolution code parameters effectively.

Key words: blind recognition, channel code, convolution code, bit error rate, decomposition of matrix